Classical Realizability in the CPS Target Language

نویسنده

  • Jonas Frey
چکیده

Motivated by considerations about Krivine’s classical realizability, we introduce a term calculus for an intuitionistic logic with record types, which we call the CPS target language. We give a reformulation of the constructions of classical realizability in this language, using the categorical techniques of realizability triposes and toposes. We argue that the presentation of classical realizability in the CPS target language simplifies calculations in realizability toposes, in particular it admits a nice presentation of conjunction as intersection type which is inspired by Girard’s ludics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relating Classical Realizability and Negative Translation for Existential Witness Extraction

Friedman showed how to turn a classical proof of a Σ 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classical proofs of such formulae. In this paper we show how to achieve the same goal efficiently using Krivine realizability with primitive numerals, and prove that the corresponding program is but the direct-style equivalent...

متن کامل

Constructive Classical Logic as CPS-Calculus

We establish the Curry-Howard isomorphism between constructive classical logic and CPS-calculus. CPS-calculus exactly means the target language of Continuation Passing Style(CPS) transforms. Constructive classical logic we refer to are LKT and LKQ introduced by Danos et al.(1993).

متن کامل

Classical realizability and arithmetical formul{\ae}

In this paper we treat the specification problem in classical realizability (as defined in [20]) in the case of arithmetical formulae. In the continuity of [10] and [11], we characterize the universal realizers of a formula as being the winning strategies for a game (defined according to the formula). In the first section we recall the definition of classical realizability, as well as a few tec...

متن کامل

Realizing arithmetical formulæ

Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical realizability Realizability game Zoology Gender equality Introduction Curry-Howard Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical ...

متن کامل

Specifying Peirce's law in classical realizability

This paper deals with the specification problem in classical realizability (such as introduced by Krivine [17]), which is to characterize the universal realizers of a given formula by their computational behavior. After recalling the framework of classical realizability, we present the problem in the general case and illustrate it with some examples. In the rest of the paper, we focus on Peirce...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 325  شماره 

صفحات  -

تاریخ انتشار 2016